Comparative Analysis of Constructive Heuristic Algorithms for Transmission Expansion Planning

Transmission expansion planning based on merchandizing surplus of transmission lines

This paper proposes an optimal transmission expansion planning (TEP) which is based on determining share of each line in merchandizing surplus (MS) of system, determining by Independent System Operator (ISO). The more share of a line in MS of system denotes the priority of a line for expansion. The procedure of determining MS of each line in a power system is based on determining the MS share o...

A Transmission Expansion Planning Model for Maximizing Merchant Investment

transmission expansion planning based on merchandizing surplus of transmission lines

this paper proposes an optimal transmission expansion planning (tep) which is based on determining share of each line in merchandizing surplus (ms) of system, determining by independent system operator (iso). the more share of a line in ms of system denotes the priority of a line for expansion. the procedure of determining ms of each line in a power system is based on determining the ms share o...

Two Algorithms Suitable for Constructive Utility Planning

We discuss two algorithms suitable for constructive utility planning using both actions and observations, which are based on iterative plan modification instead of n-step plan generation. We have analysed runtime costs and solution quality both theoretically and on a set of examples. For most situations we analysed, our algorithms perform better than conventional plan generation algorithms usin...

A comparative runtime analysis of heuristic algorithms for satisfiability problems

The satisfiability problem is a basic core NP-complete problem. In recent years, a lot of heuristic algorithms have been developed to solve this problem, and many experiments have evaluated and compared the performance of different heuristic algorithms. However, rigorous theoretical analysis and comparison are rare. This paper analyzes and compares the expected runtime of three basic heuristic ...